On a {k 4 , K 2,2,2 }-ultrahomogeneous Graph
نویسنده
چکیده
The existence of a connected 12-regular {K4,K2,2,2}-ultrahomogeneous graph G is established, (i.e. each isomorphism between two copies of K4 or K2,2,2 in G extends to an automorphism of G), with the 42 ordered lines of the Fano plane taken as vertices. This graph G can be expressed in a unique way both as the edge-disjoint union of 42 induced copies of K4 and as the edge-disjoint union of 21 induced copies of K2,2,2, with no more copies of K4 or K2,2,2 existing in G. Moreover, each edge of G is shared by exactly one copy of K4 and one of K2,2,2. While the line graphs of d-cubes, (3 ≤ d ∈ ZZ), are {Kd,K2,2}-ultrahomogeneous, G is not even line-graphical. In addition, the chordless 6-cycles of G are seen to play an interesting role and some self-dual configurations associated to G with 2-arc-transitive, arc-transitive and semisymmetric Levi graphs are considered.
منابع مشابه
On C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملOn K*-Ultrahomogeneous Graphs
Let C be any class of graphs. A graph G is C-ultrahomogeneous if every isomorphism between induced subgraphs belonging to C extends to an automorphism of G. We study graphs that are K∗-ultrahomogeneous, where K∗ is the class of complete graphs. We also explicitly classify the graphs that are tK∗-ultrahomogeneous, where tK∗ is the class of disjoint unions of complete graphs.
متن کاملOn certain C-ultrahomogeneous graphs obtained from cubic distance transitive graphs
The notion of a C-ultrahomogeneous (or C-UH) graph due to D. Isaksen et al. is adapted for digraphs and applied to the cubic distance-transitive graphs considered both as graphs and digraphs when C is formed by shortest cycles and (k − 1)-paths with k = arc-transitivity. Moreover, (k − 1)powers of shortest cycles taken with orientation assignments that make these graphs become C-UH digraphs are...
متن کاملPappus-Desargues digraph confrontation
Like the Coxeter graph became reattached into the Klein graph in [3], the Levi graphs of the 93 and 103 self-dual configurations, known as the Pappus and Desargues (k-transitive) graphs P and D (where k = 3), also admit reattachments of the distance-(k − 1) graphs of half of their oriented shortest cycles via orientation assignments on their common (k−1)-arcs, concurrent for P and opposite for ...
متن کاملOn a C4-ultrahomogeneous oriented graph
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs, and then a strongly connected ~ C4-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles is presented, with regular indegree and outdegree 3 and no circuits of lengths 2 and 3, by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in w...
متن کامل